The parallel composition of uniform processes with data

Jan Friso Grootel ,2 & Jos van Wamell 1. OWl P. O. Box 94079, 1090 GB Amsterdam, The Netherlands 2. Eindhoven University of Technology Department of Mathematics and Computing Science P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-mail: {jfg.jos}~cwi.n1 A general basis for the definition of a finite but unbounded number of parallel processes is the equation S(n, dt) = P(O, get(O, dt))< eq(n, 0) .(P(n, get(n, dt)) II S(n 1, dt)). In this formula eq(n,O) is an equality test, and get(n, dt) denotes the n-th data element in table dt. We derive a linear process equation with the same behaviour as Sen, dt), and show that this equation is well-defined, provided one adopts the principle CL-RSP from [4]. In order to demonstrate the strength of our result, we use it for the analysis of a standard example. We show that n + 1 concatenated buffers form a queue of capacity n + 1.